Classification of Orthogonal Arrays by Integer Programming
نویسندگان
چکیده
The problem of classifying all isomorphism classes of OA(N, k, s, t)s is shown to be equivalent to finding all isomorphism classes of non-negative integer solutions to a system of linear equations under the symmetry group of the system of equations. A branch-and-cut algorithm developed by Margot (2002, 2003a, 2003b, 2005) for solving integer programming problems with large symmetry groups is used to find all non-isomorphic OA(24, 7, 2, 2)s, OA(24, k, 2, 3)s for 6 ≤ k ≤ 11, OA(32, k, 2, 3)s for 6 ≤ k ≤ 11, OA(40, k, 2, 3)s for 6 ≤ k ≤ 10, OA(48, k, 2, 3)s for 6 ≤ k ≤ 8, OA(56, k, 2, 3)s, OA(80, k, 2, 4)s, OA(112, k, 2, 4)s, for k = 6, 7, OA(64, k, 2, 4), OA(96, k, 2, 4)s for k = 7, 8, and OA(144, k, 2, 4)s for k = 8, 9. Further applications to classifying covering arrays with the minimum number of runs and packing arrays with the maximum number of runs are presented.
منابع مشابه
Hilbert Bases for Orthogonal Arrays
In this paper, we relate the problem of generating all 2-level orthogonal arrays of given dimension and force, i.e. elements in OA(n, m), where n is the number of factors and m the force, to the solution of an Integer Programming problem involving rational convex cones. We do not restrict the number of points in the array, i.e. we admit any number of replications. This problem can be theoretica...
متن کاملEnumeration of Strength Three Orthogonal Arrays and Their Implementation in Parameter Design
This paper describes the construction and enumeration of mixed orthogonal arrays (MOA) to produce optimal experimental designs. A MOA is a multiset whose rows are the different combinations of factor levels, discrete values of the variable under study, having very well defined features such as symmetry and strength three (all main interactions are taken in consideration). The applied methodolog...
متن کاملβ-galactosidase Production by Aspergillus niger ATCC 9142 Using Inexpensive Substrates in Solid-State Fermentation: Optimization by Orthogonal Arrays Design
Background: Enzymatic hydrolysis of lactose is one of the most important biotechnological processes in the food industry, which is accomplished by enzyme β-galactosidase (β-gal, β-D-galactoside galactohydrolase, EC 3.2.1.23), trivial called lactase. Orthogonal arrays design is an appropriate option for the optimization of biotechnological processes for the production of microbial...
متن کاملA Study of Integer Sequences, Riordan Arrays, Pascal-like Arrays and Hankel Transforms
We study integer sequences and transforms that operate on them. Many of these transforms are defined by triangular arrays of integers, with a particular focus on Riordan arrays and Pascal-like arrays. In order to explore the structure of these transforms, use is made of methods coming from the theory of continued fractions, hypergeometric functions, orthogonal polynomials and most importantly f...
متن کاملA linear programming bound for orthogonal arrays with mixed levels
We show how the Delsarte theory can be used to obtain a linear programming bound for orthogonal arrays with mixed levels. Even for strength 2 this improves on the Rao bound in a large number of cases. The results point to several interesting sets of parameters for which the existence of the arrays is at present undecided. A M S classification: 05 B15; 62 K15
متن کامل